Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language

نویسندگان

  • Huibiao Zhu
  • Fan Yang
  • Jifeng He
  • Jonathan P. Bowen
  • Jeff W. Sanders
  • Shengchao Qin
چکیده

Complex sfotware systems typically involve features like time, concurrency and probability, and probabilistic computations are playing an increasing role. However it is currently challenging to formalize languages incorporating all those features. Recently the language PTSC has been proposed to integrate probability and time with shared-variable concurrency [56, 59], where the operational semantics has been explored and a set of algebraic laws has been investigated via bisimulation. This paper investigates the link between the operational and algebraic semantics of PTSC, highlighting both its theoretical and practical aspects. The link is obtained by deriving the operational semantics from the algebraic, an approach which may be understood as establishing soundness of the operational semantics with respect to the algebraic semantics. Algebraic laws are provided which suffice to convert any PTSC program into a form consisting of a guarded choice or an internal choice between programs which are initially deterministic. That form corresponds to a simple execution of the program, so it is used as a basis for an operational semantics. In that way, the operational semantics is derived from the algebraic, with transition rules resulting from the derivation strategy. In fact the derived transition rules and the derivation strategy are shown to be equivalent, which may be understood as establishing completeness of the operational semantics with respect to the algebraic semantics. That theoretical approach to the link is complemented by a practical one, which animates the link using Prolog. The link between the two semantics proceeds via head normal form. Firstly, generation of head normal form is explored, in particular animating the expansion laws for probabilistic interleaving. Then the derivation of the operational semantics is animated using a strategy which exploits head normal form. The operational semantics is also animated. Those animations, which again supports to claim soundness and completeness of the operational semantics with respect to the algebraic, are interesting because they provide a practical demonstration of the theoretical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanical Approach to Linking Operational Semantics and Algebraic Semantics for Verilog Using Maude

Verilog is a hardware description language (HDL) that has been standardized and widely used in industry. It contains interesting features such as event-driven computation and shared-variable concurrency. This paper considers how the algebraic semantics links with the operational semantics for Verilog. Our approach is to apply the equational and rewriting logic system Maude in exploring the link...

متن کامل

Testing Semantics for a Probabilistic-Timed Process Algebra

In this paper we present a probabilistic-timed process algebra, which try to unify the best solutions of previous probabilistic and timed algebras. We provide an operational semantics for the new language (PTPA), and from this operational semantics we define a testing semantics based on the probability with which processes pass tests. Afterwards the induced testing equivalence is operationally ...

متن کامل

A translation of TPALp into a class of timed-probabilistic Petri nets

TPALp is an algebraic language for the description of concurrent systemswith capabilities to express timed and probabilistic behaviours, as well as urgent interactions. In this paper we present the main features of the language, its operational semantics, and a translation of TPALp terms into a particular class of timed-probabilistic Petri nets. The language includes a probabilistic choice oper...

متن کامل

Probabilistic Concurrent Constraint Programming

We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators for default reasoning. We extend pcc uniformly over time, to get a synchronous reactive probabilistic programming language, Timed pcc. We describe operational and denotational models for pcc (and Timed pcc). The key feature of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Algebr. Program.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2012